Search with Adverse Selection∗
نویسنده
چکیده
This paper introduces a sequential search model with adverse selection. We study information aggregation by the price–how close the equilibrium prices are to the full information prices–when the search frictions are small. We identify circumstances under which prices fail to aggregate information well even when the search frictions are small. We trace this to a strong form of the winner’s curse that is present in the sequential search model. The failure of information aggregation may result in inefficient allocations. JEL Classifications: D44, D82, D83
منابع مشابه
A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملThe Effect of Deviation from Optimal Cash Level on Adverse Selection and Moral Hazard in Firms Listed on Tehran Stock Exchange
This study aims to investigate the impact of deviation from optimal level of cash holdings on adverse selection and moral hazard problems. The data set includes 106 listed firms of Tehran Stock Exchange during the period of 2005-2016 and both panel data and cross-sectional data multivariate regressions were utilized in different stage of analysis to test the hypotheses. According to the optimal...
متن کاملThe Analysis of the Existence of the Hypothesis of Adverse Selection on the Relationship between Off-balance Sheet Items and the Bank's Risk
Balance sheet itself does not specify and show all the activities that a bank pays. Because banks can do many swap contracts and obligations, exchange, and commitments Outside of the balance sheet. To such activities and exchange that will not appear on the balance sheet, are saying off-balance sheet activities. These items are usually reported in the notes to the attached financial statements....
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کامل